#include <iostream>
#include <queue>
#include <vector>
#include <set>

using namespace std;
typedef long long LL;
const int coeff[3] = {2, 3, 5};

int main()
{
    std::priority_queue<LL, vector<LL>, greater<LL> > pq;
    set<LL> s;
    pq.push(1);
    s.insert(1);
    for (int i = 1; ; ++i)
    {
        LL x = pq.top(); pq.pop();
        if (1500 == i)
        {
            cout << x << endl;
            break;
        }

        for (int j = 0; j < 3; ++j)
        {
            LL x2 = x * coeff[j];
            if (0 == s.count(x2))
            {
                s.insert(x2); pq.push(x2);
            }
        }
    }

    return 0;
}
